Monotonicity of the order of (D; g)-cagesBALBUENA, C; MARCOTE, X.Applied mathematics letters. 2011, Vol 24, Num 11, pp 1933-1937, issn 0893-9659, 5 p.Article

Sums of powers of the degrees of a graphCIOABA, Sebastian M.Discrete mathematics. 2006, Vol 306, Num 16, pp 1959-1964, issn 0012-365X, 6 p.Article

Efficient computation of the Lovász Theta function for a class of circulant graphsBRIMKOV, Valentin E; BARNEVA, Reneta P; KLETTE, Reinhard et al.Lecture notes in computer science. 2004, pp 285-295, issn 0302-9743, isbn 3-540-24132-9, 11 p.Conference Paper

A note on class one graphs with maximum degree sixXUECHAO LI; RONG LUO; JIANBING NIU et al.Discrete mathematics. 2006, Vol 306, Num 13, pp 1450-1455, issn 0012-365X, 6 p.Article

Large planar graphs with given diameter and maximum degreeFELLOWS, M; HELL, P; SEYFFARTH, K et al.Discrete applied mathematics. 1995, Vol 61, Num 2, pp 133-153, issn 0166-218XArticle

Non-separating trees in connected graphsDIWAN, Ajit A; THOLIYA, Namrata P.Discrete mathematics. 2009, Vol 309, Num 16, pp 5235-5237, issn 0012-365X, 3 p.Article

On the domination number of Hamiltonian graphs with minimum degree sixXING, Hua-Ming; HATTINGH, Johannes H; PLUMMER, Andrew R et al.Applied mathematics letters. 2008, Vol 21, Num 10, pp 1037-1040, issn 0893-9659, 4 p.Article

On chromatic sums and distributed resource allocationBAR-NOY, A; BELLARE, M; HALLDORSSON, M. M et al.Information and computation (Print). 1998, Vol 140, Num 2, pp 183-202, issn 0890-5401Article

Choosability of the square of planar subcubic graphs with large girthHAVET, F.Discrete mathematics. 2009, Vol 309, Num 11, pp 3553-3563, issn 0012-365X, 11 p.Article

Polynomial-Time Algorithm for Simulation of Weakly Interacting Quantum Spin SystemsBRAVYI, Sergey; DIVINCENZO, David; LOSS, Daniel et al.Communications in mathematical physics. 2008, Vol 284, Num 2, pp 481-507, issn 0010-3616, 27 p.Article

A new degree condition for graphs to have [a, b]-factorJIANXIANG LI.Discrete mathematics. 2005, Vol 290, Num 1, pp 99-103, issn 0012-365X, 5 p.Article

Mathematical theory of truth-valued flow inferenceWANG, P. Z; ZHANG, X. H; LUI, H. C et al.Fuzzy sets and systems. 1995, Vol 72, Num 2, pp 221-238, issn 0165-0114Article

New results for the degree/diameter problemDINNEEN, M. J; HAFNER, P. R.Networks (New York, NY). 1994, Vol 24, Num 7, pp 359-367, issn 0028-3045Article

A Note on the Upper Bound for the Paired-Domination Number of a Graph with Minimum Degree At Least TwoSHENWEI HUANG; ERFANG SHAN.Networks (New York, NY). 2011, Vol 57, Num 2, pp 115-116, issn 0028-3045, 2 p.Article

Graphs of order two less than the Moore boundMILLER, Mirka; SIMANJUNTAK, Rinovia.Discrete mathematics. 2008, Vol 308, Num 13, pp 2810-2821, issn 0012-365X, 12 p.Article

Four gravity resultsDVORAK, Z; SKREKOVSKI, R; VALLA, T et al.Discrete mathematics. 2007, Vol 307, Num 2, pp 181-190, issn 0012-365X, 10 p.Article

On the complexity of distributed network decompositionPANCONESI, A; ARAVIND SRINIVASAN.Journal of algorithms (Print). 1996, Vol 20, Num 2, pp 356-374, issn 0196-6774Article

Irregularity strength of regular graphs of large degreeAMAR, D.Discrete mathematics. 1993, Vol 114, Num 1-3, pp 9-17, issn 0012-365XConference Paper

A note on K₄-closures in Hamiltonian graph theoryBROERSMA, H. J.Discrete mathematics. 1993, Vol 121, Num 1-3, pp 19-23, issn 0012-365XConference Paper

Some sufficient conditions for a planar graph of maximum degree six to be Class 1YUEHUA BU; WEIFAN WANG.Discrete mathematics. 2006, Vol 306, Num 13, pp 1440-1445, issn 0012-365X, 6 p.Article

New streaming algorithms for counting triangles in graphsJOWHARI, Hossein; GHODSI, Mohammad.Lecture notes in computer science. 2005, pp 710-716, issn 0302-9743, isbn 3-540-28061-8, 7 p.Conference Paper

Chordal topologies for interconnection networksBEIVIDE, Ramon; MARTINEZ, Carmen; IZU, Cruz et al.Lecture notes in computer science. 2003, pp 385-392, issn 0302-9743, isbn 3-540-20359-1, 8 p.Conference Paper

Edge-coloring critical graphs with high degreeMIAO, Lian-Ying; WU, Jian-Liang.Discrete mathematics. 2002, Vol 257, Num 1, pp 169-172, issn 0012-365X, 4 p.Article

On the maximum size of (p, Q)-free familiesFÜREDI, Zoltan; GYARFAS, Andras; RUSZINKO, Miklos et al.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 385-403, issn 0012-365X, 19 p.Article

Improved non-approximability results for minimum vertex cover with density constraintsCLEMENTI, A. E. F; TREVISAN, L.Theoretical computer science. 1999, Vol 225, Num 1-2, pp 113-128, issn 0304-3975Article